Dictionnaire Étymologique Roman (DÉRom) 2
نویسندگان
چکیده
منابع مشابه
Dictionnaire automatique et dictionnaire-Machine: une Hypothese
1. Pendant quatre ans le groupe de recherche linguistique du C N U C E a produit un dictionnaire automatique de la langue italienne, c'est-fi-dire tree liste de toutes les formes, lemmatis~es et enregistr~es sur m~moire p6riphdrique. Pour cette production on a employS: a) une liste d'entr~es d6crites soit sous raspect lexical, soit sous l'aspect .morphologique; b) des programmes de flexion port...
متن کاملDu corpus au dictionnaire
In this article, we propose an automatic process to build multi-lingual lexico-semantic resources. The goal of these resources is to browse semantically textual information contained in texts of different languages. This method uses a mathematical model called Atlas sémantiques in order to represent the different senses of each word. It uses the linguistic relations Cahiers de Linguistique, 33(...
متن کاملA characterization of trees with equal Roman 2-domination and Roman domination numbers
Given a graph $G=(V,E)$ and a vertex $v in V$, by $N(v)$ we represent the open neighbourhood of $v$. Let $f:Vrightarrow {0,1,2}$ be a function on $G$. The weight of $f$ is $omega(f)=sum_{vin V}f(v)$ and let $V_i={vin V colon f(v)=i}$, for $i=0,1,2$. The function $f$ is said to bebegin{itemize}item a Roman ${2}$-dominating function, if for every vertex $vin V_0$, $sum_{uin N(v)}f(u)geq 2$. The R...
متن کاملMixed Roman domination and 2-independence in trees
Let $G=(V, E)$ be a simple graph with vertex set $V$ and edge set $E$. A {em mixed Roman dominating function} (MRDF) of $G$ is a function $f:Vcup Erightarrow {0,1,2}$ satisfying the condition that every element $xin Vcup E$ for which $f(x)=0$ is adjacentor incident to at least one element $yin Vcup E$ for which $f(y)=2$. The weight of anMRDF $f$ is $sum _{xin Vcup E} f(x)$. The mi...
متن کاملRoman Domination
In his article published in 1999, Ian Stewart discussed a strategy of Emperor Constantine for defending the Roman Empire. Motivated by this article, Cockayne et al.(2004) introduced the notion of Roman domination in graphs. Let G = (V,E) be a graph. A Roman dominating function of G is a function f : V → {0, 1, 2} such that every vertex v for which f(v) = 0 has a neighbor u with f(u) = 2. The we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista GTLex
سال: 2020
ISSN: 2447-9551
DOI: 10.14393/lex5-v3n1a2017-11